#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N=2e5+10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
ll a[N];
int n,q;
void solve()
{
	cin>>n>>q;
	for(int i=1;i<=n;i++) cin>>a[i],a[i]+=a[i-1];
	while(q--)
	{
		ll l,r,k;
		cin>>l>>r>>k;
		if((a[n]-(a[r]-a[l-1])+k*(r-l+1))%2) cout<<"YES"<<'\n';
		else cout<<"NO"<<'\n';
	}


}

int main()
{
	close();
	int T; cin>>T;
	while (T--) solve();
	return 0;
}

